jModelTest 2: more models, new heuristics and parallel computing
نویسندگان
چکیده
منابع مشابه
Nature Methods jModelTest 2 : more models , new heuristics and parallel computing
jModelTest 2: more models, new heuristics and parallel computing Diego Darriba, Guillermo L. Taboada, Ramón Doallo and David Posada Supplementary Table 1. New features in jModelTest 2 Supplementary Table 2. Model selection accuracy Supplementary Table 3. Mean square errors for model averaged estimates Supplementary Note 1. Hill-climbing hierarchical clustering algorithm Supplementary Note 2. He...
متن کاملEfficient Dodgson-Score Calculation Using Heuristics and Parallel Computing
Conflict of interest is the permanent companion of any population of agents (computational or biological). For that reason, the ability to compromise is of paramount importance, making voting a key element of societal mechanisms. One of the voting procedures most often discussed in the literature and, due to its intuitiveness, also conceptually quite appealing is Charles Dodgson’s scoring rule,...
متن کاملParallel Meta-heuristics Parallel Meta-heuristics
We present a state-of-the-art survey of parallel meta-heuristic strategies, developments, and results. We discuss general design and implementation principles that apply to most metaheuristic classes and instantiate these principles for neighborhood and population-based metaheuristics. We also identify a number of trends and promising research directions.
متن کاملTwo new fast heuristics for mapping parallel applications on cloud computing
In this paper two new heuristics, named Min–min-C and Max–min-C, are proposed able to provide nearoptimal solutions to themapping of parallel applications, modeled as Task Interaction Graphs, on computational clouds. The aim of these heuristics is to determine mapping solutions which allow exploiting at best the available cloud resources to execute such applications concurrentlywith the other c...
متن کاملAutomatic choice of scheduling heuristics for parallel/distributed computing
Task mapping and scheduling are two very difficult problems that must be addressed when a sequential program is transformed into a parallel program. Since these problems are NP-hard, compiler writers have opted to concentrate their efforts on optimizations that produce immediate gains in performance. As a result, current parallelizing compilers either use very simple methods to deal with task s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Methods
سال: 2012
ISSN: 1548-7091,1548-7105
DOI: 10.1038/nmeth.2109